On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases
نویسنده
چکیده
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given.
منابع مشابه
On the Frequency and Periodicity of Infinite Words On the Frequency and Periodicity of Infinite Words
This work contributes to two aspects of the understanding of infinite words: the frequency of letters in a morphic sequence and periodicity considerations on infinite words. First, we develop a necessary and sufficient criteria for the existence of the frequency of a letter in a morphic sequence, and give some applications of this result. We show that the frequencies of all letters exist in pur...
متن کاملOn Uniformly Recurrent Morphic Sequences
In the paper we mainly deal with two well-known types of in nite words: morphic and uniformly recurrent (=almost periodic). We discuss the problem of nding criterion of uniform recurrence for morphic sequences and give e ective polynomial-time such criterion in two particular cases: pure morphic sequences and automatic sequences. We also prove that factor complexity of arbitrary uniformly recur...
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملOn Subword Complexity of Morphic Sequences
We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either Θ(n) for some k ∈ N, or is
متن کاملPseudopalindrome closure operators in free monoids
We consider involutory antimorphisms θ of a free monoid A∗ and their fixed points, called θ-palindromes or pseudopalindromes. A θ-palindrome reduces to a usual palindrome when θ is the reversal operator. For any word w ∈ A∗ the right (resp. left) θ-palindrome closure of w is the shortest θ-palindrome having w as a prefix (resp. suffix). We prove some results relating θ-palindrome closure operat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007